Bases Collapse in Holographic Algorithms
نویسندگان
چکیده
Holographic algorithms are a novel approach to design polynomial time computations using linear superpositions. Most holographic algorithms are designed with basis vectors of dimension 2. Recently Valiant showed that a basis of dimension 4 can be used to solve in P an interesting (restrictive SAT) counting problem mod 7. This problem without modulo 7 is #P-complete, and counting mod 2 is NP-hard. We give a general collapse theorem for bases of dimension 4 to dimension 2 in the holographic algorithms framework. We also define an extension of holographic algorithms to allow more general support vectors. Finally we give a Basis Folding Theorem showing that in a natural setting the support vectors can be simulated by bases of dimension 2.
منابع مشابه
Holographaic Alogorithms on Bases of Rank 2
An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized by matchgates under a suitable basis transformation (SRP). For holographic algorithms on domain size 2, [1, 2, 4, 5] have built a systematical theory. In this paper, we reduce SRP on domain size k ≥ 3 to SRP on domain size 2 for holographic algorithms on bases of rank 2. Fur...
متن کاملA New Class of Holographic Algorithms: Fibonacci Gates
We introduce Fibonacci gates as a polynomial time computable primitive, and develop a theory of holographic algorithms based on these gates. The Fibonacci gates play the role of matchgates in Valiant’s theory [16]. We develop a signature theory and characterize all realizable signatures for Fibonacci gates. For bases of arbitrary dimensions we prove a universal bases collapse theorem. We apply ...
متن کاملA Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4
Holographic algorithms with matchgates are a novel approach to design polynomial time computation. It uses Kasteleyn’s algorithm for perfect matchings, and more importantly a holographic reduction. The two fundamental parameters of a holographic reduction are the domain size k of the underlying problem, and the basis size l. A holographic reduction transforms the computation to matchgates by a ...
متن کاملHolographic Algorithms: The Power of Dimensionality Resolved
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speed-ups in computation. A fundamental parameter in holographic algorithms is the dimension of the linear basis vectors. We completely resolve the problem of the power of higher dimensional bases.We prove that 2-dimensional bases are universal for holographic algorithms. © 2009 Elsevier B.V. All rights res...
متن کاملPERFORMANCE-BASED OPTIMIZATION AND SEISMIC COLLAPSE SAFETY ASSESSMENT OF STEEL MOMENT FRAMES
The main aim of the present study is to optimize steel moment frames in the framework of performance-based design and to assess the seismic collapse capacity of the optimal structures. In the first phase of this study, four well-known metaheuristic algorithms are employed to achieve the optimization task. In the second phase, the seismic collapse safety of the obtained optimal designs is evalua...
متن کامل